Relational presheaves, change of base and weak simulation

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relational presheaves, change of base and weak simulation

We show that considering labelled transition systems as relational presheaves captures several recently studied examples in a general setting. This approach takes into account possible algebraic structure on labels. We show that left (2-)adjoints to change-of-base functors between categories of relational presheaves with relational morphisms always exist and, as an application, that weak closur...

متن کامل

Weak Equivalences of Simplicial Presheaves

Weak equivalences of simplicial presheaves are usually defined in terms of sheaves of homotopy groups. We give another characterization using relative-homotopy-liftings, and develop the tools necessary to prove that this agrees with the usual definition. From our lifting criteria we are able to prove some foundational (but new) results about the local homotopy theory of simplicial presheaves.

متن کامل

Change of Base for Relational Variable Sets

Following [5], a relational variable set on a category B is a lax functor B → Rel, where Rel is the category of sets and relations. Change-of-base functors and their adjoints are considered for certain categories of relational variable sets and applied to construct the simplification of a dynamic set (in the sense of [11]).

متن کامل

Relational Presheaves as Labelled Transition Systems

We show that viewing labelled transition systems as relational presheaves captures several recently studied examples. This approach takes into account possible algebraic structure on labels. Weak closure of a labelled transition system is characterised as a left (2-)adjoint to a change-of-base functor. A famous application of coalgebra [3, 4] is as a pleasingly abstract setting for the theory o...

متن کامل

Relational Presheaves as Labelled Transition Systems

We show that viewing labelled transition systems as relational presheaves captures several recently studied examples. This approach takes into account possible algebraic structure on labels. Weak closure of a labelled transition system is characterised as a left (2-)adjoint to a change-of-base functor. A famous application of coalgebra theory [3] is as a pleasingly abstract setting for the theo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 2015

ISSN: 0022-0000

DOI: 10.1016/j.jcss.2014.12.007